Condition-number-regularized covariance estimation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CONDITION NUMBER REGULARIZED COVARIANCE ESTIMATION By Joong - Ho Won

Estimation of high-dimensional covariance matrices is known to be a difficult problem, has many applications, and is of current interest to the larger statistics community. In many applications including so-called the “large p small n” setting, the estimate of the covariance matrix is required to be not only invertible, but also well-conditioned. Although many regularization schemes attempt to ...

متن کامل

MAXIMUM LIKELIHOOD COVARIANCE ESTIMATION WITH A CONDITION NUMBER CONSTRAINT By

High dimensional covariance estimation is known to be a difficult problem, has many applications and is of current interest to the larger statistical community. We consider the problem of estimating the covariance matrix of a multivariate normal distribution in the “large p small n” setting. Several approaches to high dimensional covariance estimation have been proposed in the literature. In ma...

متن کامل

Regularized estimation of large covariance matrices

This paper considers estimating a covariance matrix of p variables from n observations by either banding or tapering the sample covariance matrix, or estimating a banded version of the inverse of the covariance. We show that these estimates are consistent in the operator norm as long as (logp)/n→ 0, and obtain explicit rates. The results are uniform over some fairly natural well-conditioned fam...

متن کامل

Regularized Estimation of High-dimensional Covariance Matrices

Regularized Estimation of High-dimensional Covariance Matrices

متن کامل

Reliable Iterative Condition-Number Estimation

The talk will present a reliable Krylov-subspace method for estimating the spectral condition number of a matrix A. The main difficulty in estimating the condition number is the estimation of the smallest singular value  min of A. Our method estimates this value by solving a consistent least-squares minimization problem with a known minimizer using a specific Krylov-subspace method called LSQR...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Royal Statistical Society: Series B (Statistical Methodology)

سال: 2012

ISSN: 1369-7412

DOI: 10.1111/j.1467-9868.2012.01049.x